Skew rank decompositions
نویسندگان
چکیده
منابع مشابه
Finding Branch-Decompositions and Rank-Decompositions
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run...
متن کاملThe Rank and Minimal Border Strip Decompositions of a Skew Partition
λi = n. The (Durfee or Frobenius) rank of λ, denoted rank(λ), is the length of the main diagonal of the diagram of λ, or equivalently, the largest integer i for which λi ≥ i [11, p. 289]. We will assume familiarity with the notation and terminology involving partitions and symmetric functions found in [7] and [11]. Nazarov and Tarasov [9, §1], in connection with tensor products of Yangian modul...
متن کاملOrthogonal Rank Decompositions for Tensors
The theory of orthogonal rank decompositions for matrices is well understood, but the same is not true for tensors. For tensors, even the notions of orthogonality and rank can be interpreted several diierent ways. Tensor decompositions are useful in applications such as principal component analysis for multiway data. We present two types of orthogonal rank decompositions and describe methods to...
متن کاملBiclique Decompositions and Hermitian Rank
The Hermitian rank, h(A), of a Hermitian matrix A is de ned and shown to equal maxfn+(A); n (A)g, the maximum of the numbers of positive and negative eigenvalues of A. Properties of Hermitian rank are developed and used to obtain results on the minimum number, b(G), of complete bipartite subgraphs needed to partition the edge set of a graph G. Witsenhausen's inequality b(G) maxfn+(G); n (G)g is...
متن کاملSussner and Ritter: Rank-based Decompositions of Mor- Phological Templates Rank-based Decompositions of Morphological Templates
| Methods for matrix decomposition have found numerous applications in image processing, in particular for the problem of template decomposition. Since existing matrix decomposition techniques are mainly concerned with the linear domain, we consider it timely to investigate matrix decomposition techniques in the nonlinear domain with applications in image processing. The mathematical basis for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00217-7